Communication-Aware Scheduling of Precedence-Constrained Tasks
نویسندگان
چکیده
منابع مشابه
Communication-aware Fault-tolerant Scheduling Strategy for Precedence Constrained Tasks in Heterogeneous Distributed Systems
Abstract Fault-tolerant scheduling is an important issue for optimal heterogeneous distributed systems because of a wide range of resource failures. Primary-backup approach is a common methodology used for fault tolerance wherein each task has a primary copy and a backup copy on two different processors. For independent tasks, the backup copy can overload with other backup copies on the same pr...
متن کاملTowards Energy Aware Scheduling for Precedence Constrained Parallel Tasks in a Cluster
this is abstract
متن کاملA stochastic scheduling algorithm for precedence constrained tasks on Grid
This paper addresses the problems in scheduling a precedence constrained tasks of parallel application with random tasks processing time and edges communication time on Grid computing systems so as to minimize the makespan in stochastic environment. This is a difficult problem and few efforts have been reported on its solution in the literature. The problem is first formulated in a form of stoc...
متن کاملScheduling tasks with AND/OR precedence constraints
In traditional precedence-constrained scheduling a task is ready to execute when all its predecessors are complete. We call such a task an AND task. In this paper we allow certain tasks to be ready when just one of their predecessors is complete. These tasks are known as OR tasks. We analyze the complexity of two types of real-time AND/OR task scheduling problems. In the rst type of problem, al...
متن کاملProbabilistic Analysis of Scheduling Precedence Constrained Parallel Tasks on Multicomputers with Contiguous Processor Allocation
ÐGiven a set of precedence constrained parallel tasks with their processor requirements and execution times, the problem of scheduling precedence constrained parallel tasks on multicomputers with contiguous processor allocation is to find a nonpreemptive schedule of the tasks on a multicomputer such that the schedule length is minimized. This scheduling problem is substantially more difficult t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM SIGMETRICS Performance Evaluation Review
سال: 2019
ISSN: 0163-5999
DOI: 10.1145/3374888.3374897